Structural Parameterizations of Language Restricted Constraint Satisfaction Problems
نویسندگان
چکیده
We study the fixed-parameter tractability of the constraint satisfaction problem. We restrict constraint relations to languages in a family of NP-hard languages, classified by a purely combinatorial criterion that generalizes Boolean matrices with fixed row and column sum. For various natural and established structural parameterizations of the instances, we characterize the fixed-parameter tractable constraint languages in the family. Acknowledgements: This work was supported by the ERC Starting Grant 239962 (COMPLEX REASON). Publication Information: This work was presented at the Dagstuhl Seminar 12451 on “The Constraint Satisfaction Problem: Complexity and Approximability”, November 4-9, 2012. INFSYS RR 1843-13-02 1
منابع مشابه
Existentially Restricted Quantified Constraint Satisfaction
The quantified constraint satisfaction problem (QCSP) is a powerful framework for modelling computational problems. The general intractability of the QCSP has motivated the pursuit of restricted cases that avoid its maximal complexity. In this paper, we introduce and study a new model for investigating QCSP complexity in which the types of constraints given by the existentially quantified varia...
متن کاملBlowing Holes in Various Aspects of Computational Problems, with Applications to Constraint Satisfaction
We consider methods for constructing NP-intermediate problems under the assumption that P 6= NP. We generalize Ladner’s original method for obtaining NP-intermediate problems by using parameters with various characteristics. In particular, this generalization allows us to obtain new insights concerning the complexity of CSP problems. We begin by fully characterizing the problems that admit NP-i...
متن کاملConstraint Optimization Problems and Bounded Tree-Width Revisited
The valued constraint satisfaction problem (VCSP) is an optimization framework originating from artificial intelligence which generalizes the classical constraint satisfaction problem (CSP). In this paper, we are interested in structural properties that can make problems from the VCSP framework, as well as other CSP variants, solvable tooptimality in polynomial time. So far, the largest structu...
متن کاملRestricted Constraint Satisfaction Problems and the Exponential-time Hypothesis
A constraint satisfaction problem (CSP) can be represented as two structures: the structure induced by the variables and the structure induced by the constraint language. Both these parameters are amenable to restrictions which a ects the complexity of the resulting problems. In this thesis we shall use both constraint language restrictions and structural restrictions in order to create problem...
متن کاملFixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
We survey the parameterized complexity of problems that arise in artificial intelligence, database theory, and automated reasoning. In particular, we consider various parameterizations of the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries, and the propositional satisfiability problem. Furthermore, we survey parameterized algorithms for problems a...
متن کامل